Test Polynomials
نویسنده
چکیده
In this paper we show that a generic polynomial p 2 C x 1 ; :::; x n ] of degree greater than n is a strong test polynomial for monomorphisms of C x 1 ; :::; x n ]: We give also examples of strong test polynomial in the class of all endomorphisms of C x 1 ; :::; x n ]: In particular we show that a generic polynomial p 2 C x; y] of degree greater than 3 is a strong test polynomial in the class of all endomorphisms of C x; y]:
منابع مشابه
Brenstien polynomials and its application to fractional differential equation
The paper is devoted to the study of Brenstien Polynomials and development of some new operational matrices of fractional order integrations and derivatives. The operational matrices are used to convert fractional order differential equations to systems of algebraic equations. A simple scheme yielding accurate approximate solutions of the couple systems for fractional differential equations is ...
متن کامل2-d Algebraic Test for Robust Stability of Quasipolynomials with Interval Parameters
Determining the robust stability of interval quasipolynomials leads to a NP problem: an enormous number of testing edge polynomials. This paper develops an efficient approach to reducing the number of testing edge polynomials. This paper solves the stability test problem of interval quasipolynomials by transforming interval quasipolynomials into two-dimensional (2-D) interval polynomials. It is...
متن کاملOn Bounds For The Zeros of Univariate Polynomials
Problems on algebraical polynomials appear in many fields of mathematics and computer science. Especially the task of determining the roots of polynomials has been frequently investigated. Nonetheless, the task of locating the zeros of complex polynomials is still challenging. In this paper we deal with the location of zeros of univariate complex polynomials. We prove some novel upper bounds fo...
متن کاملOn Bounds For The Zeros of Univariate Polynomial
Problems on algebraical polynomials appear in many fields of mathematics and computer science. Especially the task of determining the roots of polynomials has been frequently investigated. Nonetheless, the task of locating the zeros of complex polynomials is still challenging. In this paper we deal with the location of zeros of univariate complex polynomials. We prove some novel upper bounds fo...
متن کاملA circular stability test for general polynomials *
Abstruct: We extend a new stability test proposed recently for discrete system polynomials [l] to polynomials with complex coefficients. The method is based on a three-term recursion of a conjugate symmetric sequence of polynomials. The complex version has the same relative improved efficiency as the real version in comparison to the classical Schur-Cohn formulation for counting the number of z...
متن کاملPolynomials with small Mahler measure
We describe several searches for polynomials with integer coefficients and small Mahler measure. We describe the algorithm used to test Mahler measures. We determine all polynomials with degree at most 24 and Mahler measure less than 1.3, test all reciprocal and antireciprocal polynomials with height 1 and degree at most 40, and check certain sparse polynomials with height 1 and degree as large...
متن کامل